Method and apparatus for resolving ambiguity in reception of multiple retransmitted frames

ABSTRACT

A method and apparatus for resolving ambiguity in reception of multiple retransmitted frames includes ascertaining for each data frame received from a transmitter whether the frame is a retransmitted frame. If the frame is a retransmitted frame, the frame may be stored in a resequencing buffer. If an abort timer associated with the second round of retransmission has been set for the retransmitted frame, an associated negative-acknowledgment-list (NAK-list) entry is not removed from a NAK list until the abort timer has expired. If the abort timer has not been set for the retransmitted frame, the associated NAK-list entry is removed from the NAK list. The method and apparatus may reside in a transport function in which a transmitter sends data frames to a receiver in accordance with the Radio Link Protocol interface. The transport function may reside in, e.g., a data-capable cellular or satellite-based base station and subscriber unit.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation application of U.S. application Ser.No. 09/113,996, filed Jul. 10, 1998, now U.S. Pat. No. 6,408,003, whichis a continuation-in-part of U.S. application Ser. No. 09/082,085, nowU.S. Pat. No. 6,314,101, filed May 20, 1998, which is acontinuation-in-part of U.S. application Ser. No. 08/877,294, now U.S.Pat. No. 6,011,796, filed Jun. 17, 1997.

BACKGROUND OF THE INVENTION

I. Field of the Invention

The present invention pertains generally to the field of wirelesscommunications, and more specifically to resolving ambiguity in thereception of multiple retransmitted frames.

II. Background

The field of wireless communications has many applications including,e.g., cordless telephones, paging, wireless local loops, and satellitecommunication systems. A particularly important application is cellulartelephone systems for mobile subscribers. (As used herein, the term“cellular” systems encompasses both cellular and PCS frequencies.)Various over-the-air interfaces have been developed for such cellulartelephone systems including, e.g., frequency division multiple access(FDMA), time division multiple access (TDMA), and code division multipleaccess (CDMA). In connection therewith, various domestic andinternational standards have been established including, e.g., AdvancedMobile Phone Service (AMPS), Global System for Mobile (GSM), and InterimStandard 95 (IS-95). In particular, IS-95 and its derivatives, IS-95A,IS-95B, ANSI J-STD-008, IS-99, IS-657, IS-707A, etc. (often referred tocollectively herein as IS-95), are promulgated by the TelecommunicationIndustry Association (TIA) and other well known standards bodies.

Cellular telephone systems configured in accordance with the use of theIS-95 standard employ CDMA signal processing techniques to providehighly efficient and robust cellular telephone service. An exemplarycellular telephone system configured substantially in accordance withthe use of the IS-95 standard is described in U.S. Pat. No. 5,103,459,which is assigned to the assignee of the present invention and fullyincorporated herein by reference. The aforesaid patent illustratestransmit, or forward-link, signal processing in a CDMA base station.Exemplary receive, or reverse-link, signal processing in a CDMA basestation is described in U.S. Pat. No. 6,639,906, which is assigned tothe assignee of the present invention and fully incorporated herein byreference.

In CDMA systems, over-the-air power control is a vital issue. Anexemplary method of power control in a CDMA system is described in U.S.Pat. No. 5,056,109, which is assigned to the assignee of the presentinvention and fully incorporated herein by reference.

A primary benefit of using a CDMA over-the-air interface is thatcommunications are conducted over the same RF band. For example, eachmobile subscriber unit (typically a cellular telephone) in a givencellular telephone system can communicate with the same base station bytransmitting a reverse-link signal over the same 1.25 MHz of RFspectrum. Similarly, each base station in such a system can communicatewith mobile units by transmitting a forward-link signal over another1.25 MHz of RF spectrum. It is to be understood that while 1.25 MHz is apreferred CDMA channel bandwidth, the CDMA channel bandwidth need not berestricted to 1.25 MHz, and could be any number, such as, e.g., 5 MHz.

Transmitting signals over the same RF spectrum provides various benefitsincluding, e.g., an increase in the frequency reuse of a cellulartelephone system and the ability to conduct soft handoff between two ormore base stations. Increased frequency reuse allows a greater number ofcalls to be conducted over a given amount of spectrum. Soft handoff is arobust method of transitioning a mobile unit from the coverage area oftwo or more base stations that involves simultaneously interfacing withtwo base stations. (In contrast, hard handoff involves terminating theinterface with a first base station before establishing the interfacewith a second base station.) An exemplary method of performing softhandoff is described in U.S. Pat. No. 5,267,261, which is assigned tothe assignee of the present invention and fully incorporated herein byreference.

Under the IS-99 and IS-707A standards (referred to hereinaftercollectively as IS-707A), an IS-95-compliant communications system canprovide both voice and data communications services. Data communicationservices allow digital data to be exchanged using a receiver and an RFinterface to one or more transmitters. Examples of the type of digitaldata typically transmitted using the IS-707A standard include computerfiles and electronic mail.

In accordance with both the IS-95 and IS-707A standards, the dataexchanged between a wireless terminal and a base station is processed inframes. To increase the likelihood that a frame will be successfullytransmitted during a data transmission, IS-707A employs a radio linkprotocol (RLP) to track the frames transmitted successfully, and toperform frame retransmission when a frame is not transmittedsuccessfully. Retransmission is performed up to three times in IS-707A,and it is the responsibility of the higher layer protocols to takeadditional steps to ensure that the frame transmitted is successful.

In order to track which frames have been transmitted successfully,IS-707A calls for an eight-bit sequence number to be included as a frameheader in each frame transmitted. The sequence number is incremented foreach frame from 0 to 256 and then reset back to zero. An unsuccessfullytransmitted frame is detected when a frame with an out-of-order sequencenumber is received, or an error is detected using CRC checksuminformation or other error detection methods. Once an unsuccessfullytransmitted frame is detected, the receiver transmits anegative-acknowledgment message (NAK) to the transmit system thatincludes the sequence number of the frame that was not received. Thetransmit system then retransmits the frame including the sequence numberas originally transmitted. If the retransmitted frame is not receivedsuccessfully, a second negative-acknowledgment message is sent to thetransmit system. The transmit system typically responds by notifying thecontrolling application or network layer of the failed transmission.

Under IS-95A and IS-707A, frames are transmitted once every twentymilliseconds (ms). Thus, an eight-bit sequence number can track 256frames transmitted over a five-second interval. Five seconds istypically sufficient to allow a failed frame transmission to bedetected, and a retransmission to be performed, and therefore aneight-bit sequence number provides sufficient time for frameretransmission. Thus, retransmitted frames can be uniquely identifiedwithout ambiguity caused by a sequence “wrap-around” whereby theeight-bit sequence number repeats.

Since the original development of IS-95A and IS-707A, however,additional protocols and standards have been proposed and developed thatallow data to be transmitted at greater rates. Typically, these newprotocols and standards use the same frame structure as IS-95A andIS-707A in order to maintain as much compatibility as possible withpre-existing systems and standards. Nevertheless, while maintainingcompatibility with pre-existing standards and systems is desirable, theuse of the same type of frame within these higher rate protocols andstandards substantially increases the number of frames that aretransmitted during a given period of time. For example, if thetransmission rate is increased by a factor of four, the time required totransmit 256 frames is reduced to 1.25 seconds, rather than the fiveseconds required previously. A time period of 1.25 seconds is typicallyinsufficient to allow a failed frame transmission to be detected, and aretransmission attempted, before the eight-bit sequence number repeats.Thus, the use of an eight-bit sequence number is insufficient to allowunique identification of frames for the time period necessary to performthe desired retransmission sequence.

A well-known protocol, the Radio Link Protocol (RLP), uses an eight-bitsequence counter included in frames sent over the air. The eight bitsrepresent the least significant bits of a twelve-bit counter keptinternally at both the receiver and the transmitter. The twelve-bitcounter is updated based on the eight-bit numbers sent over the air. Itstands to reason that delayed frames present a problem. If multipleframes are simultaneously sent from the transmitter but are delayed withrespect to each other at the receiver, the twelve-bit counters will beincorrectly updated and the RLP will abort.

While the number of bits in the sequence number could be increased, suchan increase would substantially alter the frame format and thereforeviolate the goal of maintaining substantial compatibility withpreviously existing systems and standards. Additionally, increasing thenumber of bits in the sequence number would waste available bandwidth. Aconventional solution such as increasing the number of bits used torepresent the sequence counter is therefore inadequate because it wouldintroduce additional overhead per transmission and decrease of the netthroughput of the transport service. Hence, it would be desirable toprovide a method for extending the sequence number range withoutmodifying the number of bits used for the sequence number. Such a methodwould advantageously be capable of interpreting an impossibly largenumber of missing data frames derived from the sequence number as adelayed frame, thereby increasing the throughput of the transportfunction. It would be advantageous, then, to provide an efficient methodof detecting delayed frames in a transport function using a minimumnumber of bits.

In the RLP transport function, which maps an eight-bit over-the-airframe sequence number to a twelve-bit sequence number, the transmitter(which may reside in a data-capable cellular- or satellite-based basestation, or a subscriber unit) may send multiple copies of the sameretransmitted frame to increase the probability of reception. Forexample, in RLP Type II (as defined in IS-95 and IS-707A), two NAKmessages are sent when a frame transmission is unsuccessful. The frameis then retransmitted twice. If the second round of transmission isunsuccessful, three more NAK messages are generated, and three copies ofthe retransmitted frame are sent. In this second round of NAK, thereexists the potential for overlap with other unsuccessfully transmittedframes. When the first of the three retransmitted copies arrives, theassociated NAK-list entry is removed from the NAK list. The second copymay be interpreted as the arrival of a retransmitted frame having thesame least-significant eight bits. Hence, there is an inherent ambiguitygenerated in mapping the eight-bit sequence number to the twelve-bitnumber because retransmitted RLP frames that have the sameleast-significant-bit values but different most-significant-bit valuesmust be differentiated based solely on observation of theleast-significant bits. Thus, there is a need for a method of resolvingambiguity in the reception of multiple retransmitted frames.

SUMMARY OF THE INVENTION

The present invention is directed to a method of resolving ambiguity inthe reception of multiple retransmitted frames. Accordingly, in oneaspect of the invention, a method of resolving ambiguity in a transportfunction in which frames are sent from a transmitter to a receiveradvantageously includes the steps of ascertaining whether each frame isa retransmitted frame; storing each retransmitted frame; determining foreach retransmitted frame whether a timer has been set; removing for eachretransmitted frame an associated list entry from a predefined list ifthe timer has not been set; and retaining for each retransmitted framethe list entry in the list, if the timer has been set, until the timerexpires. In another aspect of the invention, a data transmission systemadvantageously includes a transmitter; a receiver coupled to thetransmitter via an interface for receiving data frames from thetransmitter; and a protocol processing component housed in the receiverfor ascertaining whether the received data frames are retransmitted dataframes, storing the retransmitted data frames, determining for eachretransmitted data frame whether a timer has been set, removing for eachretransmitted data frame an associated list entry from a predefined listif the timer has not been set, and retaining for each retransmitted dataframe the list entry in the list, if the timer has been set, until thetimer expires.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a cellular telephone system.

FIG. 2 is a schematic diagram of a transmitter and receiver.

FIG. 3 is a diagram of a frame buffer and resequencing buffer.

FIG. 4 is a flow chart illustrating the operation of a transmitter and areceiver during a communication.

FIG. 5 is a flow chart illustrating the operation of the receiver duringthe reception of a newly transmitted frame.

FIG. 6 is a flow chart illustrating the operation of the receiver duringthe reception of a retransmitted frame.

FIG. 7 is a message diagram illustrating the operation of thetransmitter and the receiver during an exemplary communication.

FIG. 8 is a message diagram illustrating the operation of thetransmitter and the receiver during an exemplary communication.

FIG. 9 is a flow chart illustrating the operation of the receiver inrecognizing and processing delayed frames.

FIG. 10 is a functional diagram of a shift register used in the receiverto update a bit value specifying the next frame to be received.

FIG. 11 is a message diagram illustrating the operation of thetransmitter and the receiver during an exemplary communication involvingmultiple retransmitted frames.

FIG. 12 is a flow chart illustrating the operation of the receiver inrecognizing and processing multiple retransmitted frames.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The embodiments described hereinbelow reside in a personal communicationsystem operating in accordance with the use of CDMA signal processingtechniques of the IS-707A and IS-95 standards. While the presentinvention is especially suited for use within such a communicationssystem, it should be understood that the present invention may beemployed in various other types of communications systems that transmitdata via frames or packets, including both wireless and wirelinecommunication systems, and satellite-based communication systems.Additionally, throughout the description, various well-known systems areset forth in block form. This is done in order to avoid unnecessarilyobscuring the disclosure.

Various cellular systems for wireless telephone communication employfixed base stations that communicate with mobile units via anover-the-air interface. Such cellular systems include, e.g., AMPS(analog), IS-54 (North American TDMA), GSM (Global System for Mobilecommunications TDMA), and IS-95 (CDMA). In a preferred embodiment, thecellular system is a CDMA system.

As illustrated in FIG. 1, a CDMA wireless telephone system generallyincludes a plurality of mobile subscriber units 10, a plurality of basestations 12, base station controllers (BSCs) 14, and a mobile switchingcenter (MSC) 16. The MSC 16 is configured to interface with aconventional public switch telephone network (PSTN) 18. The MSC 16 isalso configured to interface with the BSCs 14. The BSCs 14 are coupledto the base stations 12 via backhaul lines. The backhaul lines may beconfigured in accordance with any of several known interfaces including,e.g., E1/T1, ATM, IP, PPP, Frame Relay, HDSL, ADSL, or xDSL. It is to beunderstood that there can be more than two BSCs 14 in the system. Eachbase station 12 advantageously includes at least one sector (not shown),each sector comprising an omnidirectional antenna or antenna pointed ina particular direction radially away from the base station 12.Alternatively, each sector may comprise two antennas for diversityreception. Each base station 12 may advantageously be designed tosupport a plurality of frequency assignments, with each frequencyassignment advantageously comprising 1.25 MHz of spectrum.Alternatively, each frequency assignment may comprise an amount ofspectrum other than 1.25 MHz, such as, e.g., 5 MHz. The intersection ofa sector and a frequency assignment may be referred to as a CDMAchannel. The base stations 12 may also be known as base stationtransceiver subsystems (BTSs) 12. Alternatively, “base station” may beused in the industry to refer collectively to a BSC 14 and one or moreBTSs 12. The BTSs 12 may also be denoted “cell sites” 12.(Alternatively, individual sectors of a given BTS 12 may be referred toas cell sites.) The mobile subscriber units 10 are typically cellulartelephones 10, and the cellular telephone system is advantageously aCDMA system configured for use in accordance with the IS-95 standard.

During typical operation of the cellular telephone system, the basestations 12 receive sets of reverse-link signals from sets of mobileunits 10. The mobile units 10 are conducting telephone calls or othercommunications. Each reverse-link signal received by a given basestation 12 is processed within that base station 12. The resulting datais forwarded to the BSCs 14. The BSCs 14 provide call resourceallocation and mobility management functionality including theorchestration of soft handoffs between base stations 12. The BSCs 14also route the received data to the MSC 16, which provides additionalrouting services for interface with the PSTN 18. Similarly, the PSTN 18interfaces with the MSC 16, and the MSC 16 interfaces with the BSCs 14,which in turn control the base stations 12 to transmit sets offorward-link signals to sets of mobile units 10.

In the embodiments described below, an algorithm serves to map aneight-bit sequencing number for counting frames sent over the air into atwelve-bit sequencing number in accordance with the Radio Link Protocol(RLP), a protocol that is known in the art. The algorithm isadvantageously carried out with RLP software instructions and amicroprocessor. In one embodiment, an RLP component may reside in a basestation 12. Alternatively, the RLP component may reside in a BSC 14.Those of skill in the art would appreciate that the RLP algorithm may beused not only in a BSC 14 or a base station 12, but could be used in anytransport layer in which multiple data frames are received in aparticular processing period.

In FIG. 2, two communication systems configured in accordance with anexemplary embodiment are illustrated in block form. The higher ratecommunication is being conducted from transmitter 50 to receiver 52. Inan exemplary configuration, transmitter 50 is located in a base station12 and receiver 52 is in a wireless terminal 10; however, the locationsmay be reversed. Within transmitter 50, control system 54 receives dataframes from input/output (I/O) 56 and provides that data to encoder 58.Encoder 58 performs convolutional encoding, generating code symbols thatare received by digital modulator 60. Digital modulator 60 performsdirect sequence modulation on the code symbols with one or more binarychannel codes and one or more binary spreading codes, yielding chippedsymbols that are received by radio frequency (RF) transmitter 62. Thechipped symbols are upconverted to the carrier frequency band by RFtransmitter 62 and transmitted from antenna system 64 via diplexer 66.

Various methods and apparatus for performing the digital modulation andRF upconversion can be employed. A set of particularly useful methodsand apparatus are described in U.S. Pat. No. 6,005,855, entitled METHODAND APPARATUS FOR PROVIDING VARIABLE RATE DATA IN A COMMUNICATIONSSYSTEM USING STATISTICAL MULTIPLEXING, filed Apr. 28, 1995; U.S. Pat.No. 5,777,990, entitled METHOD AND APPARATUS FOR PROVIDING VARIABLE RATEDATA IN A COMMUNICATIONS SYSTEMS USING NON-ORTHOGONAL OVERFLOW CHANNELS,filed Feb. 28, 1995; and U.S. Pat. No. 6,173,007, entitled HIGH DATARATE SUPPLEMENTAL CHANNEL FOR CDMA TELECOMMUNICATIONS SYSTEM, filed Jan.15, 1997; each of which is assigned to the assignee of the presentinvention and fully incorporated herein by reference. It should beunderstood that some of the above-referenced patent applications aredirected to the forward link, and are therefore more suited for use withthe transmitter 50, while others are directed to the reverse link, andare therefore more suited for use with the receiver 52.

In an exemplary embodiment, the data transmitted from antenna system 64is formatted in accordance with frames 70 that include an eight-bitsequence field (SEQ number) 72, a retransmit flag 74, and a data field76. A frame 70 may include other fields that are not shown because theyare not particularly relevant to the present invention. In a preferredembodiment, the frames are formatted substantially in accordance withthe frame structures defined in the IS-707A standard, with the additionof retransmit flag 74.

To provide data frames to encoder 58 in an orderly manner, controlsystem 54 stores the frames within frame buffer 55 and updates an indexvalue L_V(S). Frame buffer 55 and index value L_V(S) are preferablystored within a memory system. In a preferred embodiment, index valueL_V(S) is a twelve-bit sequence number that is incremented after thetransmission of each frame as described in greater detail below. Theleast significant eight bits of index value L_V(S) are placed in thesequence field of a frame 72.

Within receiver 52, RF receiver 80 downconverts and digitizes the RFsignals on which frame 70 is transmitted using antenna system 82 anddiplexer 84. Digital demodulator 86 demodulates the downconverted, or“baseband,” signals using the necessary binary codes, generating softdecision data that is received by decoder 88. Decoder 88 performsmaximum likelihood trellis, or Viterbi, decoding, yielding hard decisiondata 90 that is provided to controller 91.

Controller 91 reforms frame 70 using hard decision data 90 anddetermines whether the frame has been received in sequence relative tothe frames that have already been received using the SEQ number, indexvariable L_V(N), and L_V(R), as well as resequencing buffer 92 and NAKlist 94 as described in further detail below.

If controller 91 determines that the frame has been received out ofsequence relative to the frames that have already been received, or ifthe frame is received in error, it generates a negative-acknowledgment(NAK) message that is received by encoder 95. Encoder 95 performsconvolutional encoding to generate code symbols that are direct sequencespread spectrum modulated by digital modulator 97, preferably inaccordance with the IS-95 reverse link, and the chipped symbols areupconverted by RF transmit system 98 and transmitted as NAK 83 fromantenna system 82 via diplexer 84. The L_SEQ for the NAKed frame isstored within NAK list 94.

Referring again to transmitter 50, RF receiver 67 receives the RF signalvia antenna system 64 and diplexer 66. RF receiver 67 downconverts anddigitizes the RF signal, yielding samples that are demodulated usingdigital demodulator 68. Decoder 69 decodes the soft decision data fromdigital demodulator 68, and control system 54 receives the hard decisiondata from decoder 69, thereby detecting the NAK 83 from receiver 52contained in the hard decision data.

Control system 54 receives NAK 83 and retrieves the NAKed frame fromtransmit buffer 55. The retrieved frames are retransmitted in accordancewith the original transmission as described above (including theoriginal sequence number).

The configuration of frame buffer 55, resequencing buffer 92, andindexes L_V(S), L_V(N), and L_V(R), when used in accordance with oneembodiment, are illustrated in FIG. 3. Within the transmit frame buffer55, frames already transmitted once are shaded, and frames to betransmitted are clear. In a preferred embodiment, indexes L_V(S),L_V(N), and L_V(R) are twelve-bit numbers. Index L_V(S) is set to thesequence number of the next frame to be transmitted. When the frame isactually transmitted, the eight-bit SEQ number of the frame is set tothe eight least significant bits of index L_V(S).

Within resequencing buffer 92, index L_V(R) is set to the twelve-bitsequence of the next new frame expected. Index L_V(N) is set to thetwelve-bit sequence of the next frame needed for sequential delivery, orfor which processing is still pending. When a predetermined number ofNAKs 83 have been sent without receipt of the corresponding frame,attempted processing of the frame is terminated and the data with themissing frame is passed to the higher layer protocols such as, e.g., thetransport layer. As shown, NAKed frames 96 a–c can be received withsequence numbers between L_V(N) and (L_V(R)−1) MOD 4096, inclusively.

In FIG. 4, a flow diagram illustrates the operation of the transmitter50 and receiver 52 during a communication performed in accordance withone embodiment. The transmission begins at the transmitter at step 100,with reception at the receiver occurring at step 101. At step 102,initialization is performed, during which index L_V(S) is set to zerowithin transmitter 50 and L_V(R) is set to zero within receiver 52.

At step 108, the transmitter 50 transmits a frame (indicated by thedashed line) when data is available for transmission, with the SEQnumber of the frame being set to the eight least significant bits ofindex L_V(S), and being referred to as V(S). Additionally, theretransmit flag is set to zero to indicate that the frame is a newlytransmitted frame. At step 112, index L_V(S) is incremented MOD 4096,and at step 113 the transmitter performs receive processing for any NAKmessage transmitted from receiver 52. In one embodiment, when no data isavailable, “idle” frames having the current SEQ number may be sentrepeatedly until data becomes available (idle transmissions not shown).

At step 130 the transmitter 50 determines if a NAK 83 has been receivedor is pending, and if so the NAKed frames are retrieved from thetransmit buffer using the long sequence number contained in the NAKmessage and retransmitted at step 132 with the original SEQ number andthe retransmit field set to one. Once the frame is retransmitted thepending or received NAK 83 is cleared and processing then continues atstep 113.

If a NAK message has not been received or is not pending, thetransmitter returns to step 108 and the processing continues.

Within receiver 52, the processing begins at step 101, and at step 106L_V(S) is received from transmitter 50. At step 110, receiver 52receives any frames transmitted from transmitter 50 at either step 108(new transmission), or at step 132 (retransmission), and at step 114receiver 52 examines the status of the retransmit flag of the frame todetermine if the received frame is a retransmitted frame or a new frame.If the frame is a retransmitted frame, retransmit processing isperformed at step 116, and then the receiver returns to step 110. If theframe is not a retransmitted frame, first transmit processing of theframe is performed at step 120, and then step 110 is performed again.

In FIG. 5, a flow chart illustrates the operation of receiver 52 whenprocessing the first transmission of a frame during step 120 of FIG. 4in accordance with one embodiment. The first transmission processingbegins at step 150, and at step 152 L_SEQ is set according to thefollowing equation:L _(—) SEQ={L _(—) V(R)+[256+SEQ−V(R)] MOD 256} MOD 4096,  (1)where V(R) is the eight least significant bits of L_V(R) and SEQ is thesequence number contained in the SEQ field of the frame being processed.At step 154 it is determined whether L_SEQ is less than L_V(N), or thatthe frame has been stored in the resequencing buffer 92. If so, theframe is discarded at step 156 and the receive system returns from firsttransmission processing at step 157. As noted above, L_V(N) is set tothe next frame needed for sequential delivery of the data.

If L_SEQ is not less than L_V(N) and the frame has not been stored inthe resequencing buffer 92, it is further determined at step 158 whetherL_SEQ is greater than or equal to L_V(N) and less than L_V(R), andwhether the frame has been not stored in the resequencing buffer 92. Ifso, the frame is discarded at step 156 and the receive system returnsfrom first transmission processing at step 157. Otherwise, it is furtherdetermined at step 160 whether L_SEQ equals L_V(R) and therefore is thenext frame needed for sequential delivery L_V(R).

If L_SEQ does not equal L_V(R), an out-of-order frame has been received,and the frame is stored in the resequencing buffer 92 at step 162, andL_V(R) is set to L_SEQ at step 164. At step 166, the receive systemtransmits one or more NAK messages requesting retransmission of allunreceived frames from L_V(N) to (L_V(R)−1) MOD 4096, inclusive. Thereceive system then returns from the first transmission processing atstep 176.

If, at step 160, it is determined that L_SEQ equals L_V(R), the framehas been received in order, causing it to further be determined at step170 whether L_V(N) equals L_V(R), which indicates that no NAKed framesare outstanding.

If L_V(N) equals L_V(R), L_N(N) and L_V(R) are incremented MOD 4096 atstep 172. The data frame is delivered to the higher layer protocol atstep 174, and the receiver 52 returns from first transmit processing atstep 176.

If it is determined at step 160 that L_V(N) does not equals L_V(R), andtherefore that NAKed frames remain outstanding, L_V(R) is incrementedMOD 4096 at step 178, and at step 180 the frame is stored in theresequencing buffer 92. The receiver 52 then returns from the firstframe transmit processing at step 176.

In FIG. 6, a flow diagram illustrates the operation of the receiver 52during step 116 when a retransmitted frame is received in accordancewith one embodiment. The processing of the retransmitted frame begins atstep 200, and at step 202 the SEQ field in the received frame is used asthe key to look up an L_SEQ associated with the SEQ in the NAK list 94(see FIG. 2). At step 204 it is determined whether the L_SEQ is lessthan L_V(N), or whether the frame has already been stored in theresequencing buffer 92. If so, the frame is discarded at step 206, andthe receiver 52 returns from retransmit processing at step 208.

If L_SEQ is not less than L_V(N), and the frame has not been stored inthe resequencing buffer 92, it is further determined at step 210 whetherL_SEQ is greater than or equal to L_V(N) and less than L_V(R), and ifthe frame has not been stored in the resequencing buffer 92. If so, theframe is stored in the resequencing buffer 92 at step 212 before step214 is performed. Otherwise, step 214 is performed.

At step 214, it is determined whether L_SEQ is equal to L_V(N), and ifnot, the frame is discarded at step 216 because the retransmitted framehas a sequence number that is higher than the next new frame expected,and therefore an error has occurred. Once the frame has been discarded,receiver 52 returns from retransmitted frame processing at step 208.

If L_SEQ equals L_V(N), the data in all the contiguous frames formed bythe addition of the retransmitted frame being processed from L_V(N)upward are delivered to the next higher processing layer at step 218,and the delivered frames are removed from the resequencing buffer 92 atstep 220. At step 222 L_V(N) is set to LAST+1, where LAST is the longsequence number (L_SEQ) of the last frame delivered to the higher layerat step 218. At step 224 the frame is removed from the NAK list and thereceiver 52 returns from processing the retransmitted frame at step 226.

In FIG. 7, a message diagram illustrates the messages transmitted duringan exemplary communication performed in accordance with one embodiment.Transmitter 50 is shown on the left, and receiver 52 is shown on theright. Transmitter 50 maintains index L_V(S), and frames are transmittedwith value V(S) in the sequence field, where V(S) is the eight leastsignificant bits of L_V(S). At the receiver 52 the NAK list after eachtransmission is shown. All numbers are shown in hexadecimal.

The first frame 230 is transmitted when index L_V(S) is equal to 0x2FE,and therefore with a SEQ number of 0xFE. After the transmission of frame230, index L_V(S) is incremented to 0x2FF and frame 232 is transmittedwith a SEQ number of 0xFF. Both frames 230 and 232 are receivedsuccessfully by receiver 52, causing index L_V(R) to increment twicefrom 0x2FE to 0x300.

Frame 234 is transmitted with a SEQ number of 0x00 and is notsuccessfully received by receiver 52. L_V(S) is then incremented to0x301, and frame 236 is transmitted with a SEQ number of 0x01 and isreceived successfully by receiver 52.

Upon receipt of frame 236, receiver 52 detects the out-of-order sequencenumber because frame 234 was not received. In response, receiver 52generates NAK message 240 containing the full twelve-bit index L_V(R)for the unreceived frame 0x300. Additionally, receiver 52 updates theNAK list 94 to indicate that a NAK 83 has been transmitted for a framewith SEQ number 0x00 and L_SEQ number 0x300. Also, receiver 52 starts aNAK timer, which tracks the time that has expired since the transmissionof NAK message 240.

During the transmission of NAK message 240, transmitter 50 transmitsanother frame 238 with a SEQ number of 0x02, which is receivedsuccessfully by receiver 52. Upon receipt of NAK message 240,transmitter 50 generates retransmitted frame 242 having SEQ number 0x00and the retransmit flag 74 (see FIG. 2) is set to one. Upon receipt ofretransmitted frame 242, receiver 52 detects the retransmission bit andmatches the SEQ number with the SEQ number in NAK list 94. Once thematch is made, retransmitted frame 242 is placed within the resequencingbuffer 92 (see FIG. 2) and the entry within NAK list 94 is removed.Frames 244 and 246 are then transmitted and received in normal fashion.

In FIG. 8, a message diagram further illustrates the operation oftransmitter 50 and receiver 52 during a transmission in which thesequence number “wraps-around,” when performed in accordance with oneembodiment. Frames 240 a and 240 b are transmitted with SEQ numbers 0xFE(all numbers are in hexadecimal) and 0xFF, respectively, whichcorrespond to values of 0x2FE and 0x2FF for index L_V(S), and aresuccessfully received by receiver 52, causing L_V(R) to be incrementedfrom 0x2FE to 0x300.

Frame 240 c includes SEQ number 0x00 but is not successfully received byreceiver 52. Frame 240 d includes SEQ number 0x01 and is receivedproperly by receiver 52. Upon receipt of frame 240 d, receiver 52detects that the SEQ number is greater than the eight least significantbits of L_V(R), and therefore that a frame has been received out oforder. In response, receiver 52 updates L_V(R) to 0x302, whichcorresponds to the next expected frame, and places the SEQ number of theunreceived frame into NAK list 94. Additionally, receiver 52 transmitsNAK 241 containing the complete L_SEQ number 0x300 of the frame that wasnot received, and initiates a timer that tracks the amount of time thathas expired since the transmission of the NAK 241. As shown in FIG. 8,however, NAK 241 is not received successfully by transmitter 50.

Transmitter 50 continues to transmit frames as shown, including frames240 e–240 j, all of which are successfully received by receiver 52.During the transmission of frames 240 e–240 j, index L_V(S) changes from0x302 to 0x400, causing a wrap-around in eight least significant bits,and therefore in the SEQ number contained in the frames.

Frame 240 k is transmitted with SEQ number 0x01 and is not receivedsuccessfully by receiver 52. Frame 240I is transmitted with SEQ number0x02 and is received successfully by receiver 52. Upon receipt of frame240I, receiver 52 detects an out-of-order transmission, and responds bytransmitting NAK 243 containing sequence value 0x401 and by addingsequence number 0x401 to NAK list 94. Additionally, at this time thetimer for NAK 241 expires, causing a second NAK 245 containing sequencevalue 0x300 to be transmitted to transmitter 50. Thus, a second NAK istransmitted for frame 240 c. Additionally, receiver 52 sets L_V(R) tothe next expected sequence number 0x403. It should be noted that thesequence numbers transmitted in NAKs 243 and 245 could be transmitted ina single NAK message.

Transmitter 50 responds to NAKs 243 and 245 by transmittingretransmitted frame 242 a containing the data from frame 240 k, andretransmitted frame 242 b containing the data from frame 240 c. Uponreceipt of retransmission frame 242 a, receiver 52 identifies the frameas a retransmitted frame based on the status of retransmit flag 74 (seeFIG. 2). Once the frame is identified as a retransmitted frame, receiver52 performs a lookup within NAK list 94, using the SEQ number, anddetermines which frame has been retransmitted. Retransmitted frame 242 ais then placed in the appropriate location within resequencing buffer 92(see FIG. 2), and the corresponding entry is removed from NAK list 94.

Upon receipt of retransmission frame 242 b, receiver 52 also identifiesthe type of frame and performs a lookup within NAK list 94. When theidentity of the frame is determined, it is placed within theresequencing buffer 92 (see FIG. 2), and the corresponding entry isremoved from NAK list 94. Transmitter 50 then transmits frame 240 mhaving sequence number 0x03, which is successfully received by receiver52. At this point, NAK list 94 is empty.

As should be evident from the transmission shown in FIG. 8, markingframes as either “new” or “retransmitted” allows the receiver 52 toproperly process both new and retransmitted frames that have the sameSEQ numbers even when wrap-around of the sequence number occurs during aretransmission. This is possible because a retransmitted frame with thesame SEQ number as a newly transmitted frame can be distinguished by theretransmit flag. Thus, a greater number of frames may be processed usingan eight-bit sequence number, which supports significantly higher datarates while maintaining substantial computability with pre-existingstandards.

In FIG. 9, a flow chart illustrates the operation of the receiver 52 inrecognizing and processing delayed frames in accordance with oneembodiment. A delayed frame may be defined as an RLP frame that istransmitted at the same time on the over-the-air interface with a group,or bundle, of other RLP frames, but has experienced a significantlydifferent delay (e.g., due to a different path length) on its way to thereceiver 52. In accordance with the IS-707A standard and RLP, a knownprotocol for retransmission of data frames, frames are sent over the airin twenty-millisecond (ms) intervals. If the difference in the delay ismore than twenty ms, the delayed frame will be received in one of thefollowing twenty-ms processing intervals identified in IS-707A. If notdetected as a delayed frame, a delayed RLP frame may cause an RLP reset.

Equation (1), described above in connection with FIGS. 4–6, presents amethod for mapping the eight-bit SEQ number (which is transmitted as aframe header over the air) into a twelve-bit L_SEQ number at thereceiver 52 to keep track of frame sequence. If, by way of example,frames 1, 2, and 4 of a four-frame bundle are received within the sametwenty-ms time interval, but frame 3 is delayed and is received in thefollowing twenty-ms time interval, equation (1) yields the followingvalue for L_SEQ:

$\begin{matrix}{{L\_ SEQ} = {\left\{ {{{L\_ V}(R)} + {\left\lbrack {256 + {SEQ} - {V(R)}} \right\rbrack\;{MOD}\mspace{14mu} 256}} \right\}\;{MOD}\mspace{14mu} 4096}} \\{= {\left\{ {5 + {\left\lbrack {256 + 3 - 5} \right\rbrack\;{MOD}\mspace{14mu} 256}} \right\}\;{MOD}\mspace{14mu} 4096}} \\{{= {5 + 254}},}\end{matrix}$which indicates that 254 frames are missing. Clearly, this is not thecorrect interpretation because it is impossible to miss 254 frameswithin a twenty-ms time interval. In the embodiment depicted in FIG. 9,an RLP algorithm advantageously categorizes such a frame as a delayedframe at the receiver 52.

In the embodiment of FIG. 9, the value D denotes the maximum differencein the arrival time for RLP frames that are transmitted in the sametwenty-ms time interval on the over-the-air interface. D is expressed inunits of twenty-ms time intervals and is typically zero, one, or two.The number V(R)_(T−D) denotes the value of V(R) at a time of D×20 msago. The value N_(max) denotes the maximum number of frames that can besent in one twenty-ms time interval. N_(max) may be eight in aparticular embodiment. In another embodiment, N_(max) may be four.

In step 300, a frame is received at the receiver 52. The algorithm thenproceeds to step 302 and determines whether the frame is a new frame. Ifthe frame is a new frame, the algorithm proceeds to step 304. If theframe is not a new frame, the algorithm proceeds to step 306 to processthe frame as a retransmitted frame. In step 306, the algorithm processesthe frame as a retransmitted frame via a table, as described above. Thealgorithm then returns to step 300 and receives the next frame.

In step 304, the algorithm determines whether L_V(R) has been updatedwithin the past D×20 ms. LV(R) is the twelve-bit value of V(R), whichpoints to the next frame the RLP algorithm expects to receive in thereceive buffer. If L_V(R) has not been updated in the past D×20 ms,equation (1) will not yield an impossibly large number of missingframes, so the algorithm proceeds to step 306, processing the frame as aretransmitted frame. If L_V(R) has been updated within the past D×20 ms,there is a possibility that the new frame is a delayed frame, and thealgorithm proceeds to step 308.

In step 308, the algorithm commences new frame processing by computingthe value H=(256+SEQ−V(R)_(T−D)) MOD 256. The algorithm then proceeds tostep 310. In step 310, the algorithm determines whether H is greaterthan N_(max)×D. If H is greater than N_(max)×D, the algorithm detectsthe frame as a delayed frame and proceeds to step 306, advantageouslyprocessing the detected delayed frame as a retransmitted frame. Those ofskill in the art would understand that because L_SEQ equals [L_V(R)+H]MOD 4096 (see equation (1)), checking if H is greater than the thresholdvalue N_(max)×D (which represents the maximum number of frames thatcould be missing) simply amounts to comparing L_SEQ with a thresholdvalue. If L₁₃SEQ is found to exceed the threshold value, a delayed frameis detected and processed accordingly. Those of skill in the art wouldlikewise appreciate that in an alternate embodiment not employing RLPframes, the delayed frame need not necessarily be processed as aretransmitted frame, but might instead be processed in some othermanner. If H is not greater than N_(max)×D, the algorithm proceeds tostep 312 and processes the frame as a new frame via equation (1), asdescribed above. The algorithm then returns to step 300 and receives thenext frame.

In one embodiment, illustrated in FIG. 10, a shift register 400 in thereceiver 52 (see FIG. 2) may advantageously be used to keep track of thevalue of V(R)_(T−D). The shift register 400 must have D+1 stages (i.e.,the shift register 400 must have a number of bits equal to (D+1)multiplied by the bit length of V(R)). The bit value V(R) is put intothe shift register 400 and, as shown, the shift register 400 is shiftedevery twenty ms to update V(R)_(T−D). If L_V(R) (or, equivalently, V(R))was not updated within the past twenty-ms time interval, a special valuepredetermined to denote a “null” symbol is advantageously placed in theshift register 400 to represent that no change took place.

In one embodiment, illustrated in FIG. 11, a frame 500 with a SEQ numberof 0x02 and an L_V(S) number of 0x302 is sent from the transmitter(depicted functionally at top as a horizontal line) at time a. (Time isunderstood to increase as the message diagram proceeds from left toright.) As indicated by the dashed line, frame 500 number 0x302 is lostin transmission and fails to arrive at the receiver (depictedfunctionally at bottom as a horizontal line). Shortly after time a, asecond frame 502 having an L_V(S) number of 0x303 is sent from thetransmitter. At time b, frame 502 number 0x303 is received at thereceiver, a NAK message 504 for frame 500 number 0x302 is generated bythe receiver, the number 0x302 is placed in the NAK list, and aretransmit timer is initiated for frame 500 number 0x302. At time c,frame 500 number 0x302 is retransmitted by the transmitter in responseto the NAK message 504. As shown by the dashed line, the retransmittedframe 500 number 0x302 is lost in transmission and fails to arrive atthe receiver. (Alternatively, the NAK message 504 may have failed toarrive at the transmitter.) At time d, a round-trip time span haselapsed since time b. At time e, after a predefined guard time haselapsed since time d, the retransmit timer for frame 500 number 0x302expires and an abort timer for frame 500 number 0x302 is initiated. Thefirst round of retransmission (or the first round of NAK) has ended andthe second round of retransmission (or the second round of NAK) hasbegun.

At time e, a second NAK message 506 for frame 500 number 0x302 is sentby the receiver. To increase the probability of reception, multiplecopies (not shown) of the NAK message 506 may be sent. At time f, aframe 508 having a SEQ number of 0x02 and an L_V(S) number of 0x402 issent by the transmitter. As shown by the dashed line, the frame 508number 0x402 is lost in transmission and fails to arrive at thereceiver. Shortly after time f, a second frame 510 having an L_V(S)number of 0x403 is sent by the transmitter. At time g, the first ofmultiple copies, e.g., three copies, of frame 500 number 0x302 isretransmitted by the transmitter in response to the NAK message 506. Thesecond and third copies of frame 500 number 0x302 are retransmittedshortly thereafter in response to other copies (not shown) of the NAKmessage 506. At time h, frame 510 number 0x403 is received at thereceiver, a NAK message 512 for frame 508 number 0x402 is generated bythe receiver, the number 0x402 is placed in the NAK list, and aretransmit timer is initiated for frame 508 number 0x402. As defined inIS-707A, the NAK list is allowed to have only one active entry, which isdefined as the oldest entry in the NAK list. Thus, while both the entryfor frame 500 number 0x302 and the entry for frame 508 number 0x402 arein the NAK list, the SEQ number 0x02 is mapped only to the active, oroldest, entry, i.e., to the entry for frame 500 number 0x302.

At time i, a round-trip time span has elapsed since time e, and thefirst copy of the retransmitted frame 500 number 0x302 is received atthe receiver. Shortly after time i, the second and third copies of theretransmitted frame 500 number 0x302 are received in succession at thereceiver. Conventionally, the entry for frame 500 number 0x302 would beremoved from the NAK list at time i because frame 500 number 0x302 iscorrectly received at time i, with the entry for frame 508 number 0x402becoming the active, and only, entry in the NAK list. In the embodimentof FIG. 11, the entry for frame 500 number 0x302 is left in the NAK listbecause frame 500 number 0x302 is in the second round of retransmission(i.e., because the abort timer for frame 500 number 0x302 has been set).At time j, after a predefined guard time has elapsed since time i, theabort timer for frame 500 number 0x302 expires, the entry for frame 500number 0x302 is deleted from the NAK list (IS-707A specifies that anyentry corresponding to a frame whose abort timer has expired is removedfrom the NAK list), and the entry for frame 508 number 0x402 becomes theactive entry in the NAK list. Thus, prior to time j, the SEQ number 0x02is mapped only to the L_V(S) number 0x302, and after time j, the SEQnumber 0x02 is mapped only to the L_V(S) number 0x402. Thisadvantageously resolves the ambiguity that arises in a conventionalsystem in which the second and third copies of the retransmitted frame500 number 0x302 would be misinterpreted as being frame 508 number0x402.

At time k, the NAK message 512 for frame 508 number 0x402 arrives at thetransmitter. The transmitter consequently retransmits frame 508 number0x402 at time k. At time l, the retransmitted frame 508 number 0x402 isreceived at the receiver.

In accordance with one embodiment, a flow chart depicted in FIG. 12illustrates the steps taken by the receiver in connection with themessage diagram of FIG. 11. The steps shown in FIG. 11 areadvantageously performed by a microprocessor executing a set of softwareinstructions. Alternatively, the steps may be performed with hardware,firmware, a controller, a state machine, or any equivalent devices knownin the art.

In step 600 a frame (not shown), which has been transmitted from thetransmitter (also not shown), is received at the receiver (also notshown). In step 602, immediately following, it is ascertained whetherthe frame is a retransmitted frame. If the frame is not a retransmittedframe, the frame is processed as a newly transmitted frame in accordancewith step 604. If, on the other hand, the frame is a retransmittedframe, it is next determined in step 606 whether the abort timer for theframe has been set. If the abort timer for the frame has not been set,the frame is stored in the resequencing buffer (not shown) and theNAK-list entry associated with the frame is removed from the NAK list,in accordance with step 608. If, on the other hand, the abort timer forthe frame has been set (which indicates that the frame is in the secondround of NAK), the frame is stored in the resequencing buffer and theNAK-list entry associated with the frame is not removed from the NAKlist, in accordance with step 610.

Preferred embodiments of the present invention have thus been shown anddescribed. It would be apparent to one of ordinary skill in the art,however, that numerous alterations may be made to the embodiments hereindisclosed without departing from the spirit or scope of the invention.Therefore, the present invention is not to be limited except inaccordance with the following claims.

1. A method of detecting a delayed frame in a transport function whereina plurality of frames are sent from a transmitter to a receiver, themethod comprising the steps of: determining a threshold valueproportional to a product of a number of frames within a bundle offrames and a maximum delay time in frame-length time increments betweenframes sent in said bundle of frames; comparing, for a received frame, aframe sequencing counter number with said threshold value, the framesequencing counter number being derived from a header of the receivedframe; and detecting the received frame as a delayed frame if the framesequencing counter number exceeds said threshold value.
 2. The method asrecited in claim 1 wherein the plurality of frames is sent in bundles offrames, each bundle including an equal number of frames, the frameswithin any bundle being sent simultaneously.
 3. The method of claim 1,further comprising the step of processing a detected delayed frame as aretransmitted frame.
 4. The method of claim 1, wherein the transportfunction is a Radio Link Protocol interface.
 5. An apparatus fordetecting a delayed frame in a transport function wherein a plurality offrames are sent from a transmitter to a receiver, the apparatuscomprising: means for determining a threshold value proportional to aproduct of a number of frames within a bundle of frames and a maximumdelay time in frame-length time increments between frames sent in saidbundle of frames; means for comparing, for a received frame, a framesequencing counter number with said threshold value, the framesequencing counter number being derived from a header of the receivedframe; and means for detecting the received frame as a delayed frame ifthe frame sequencing counter number exceeds the threshold value.
 6. Theapparatus as recited in claim 5 wherein the plurality of frames is sentin bundles of frames, each bundle including an equal number of frames,the frames within any bundle being sent simultaneously.
 7. The apparatusof claim 5, further comprising means for processing a detected delayedframe as a retransmitted frame.
 8. The apparatus of claim 5, wherein thetransport function is a Radio Link Protocol interface.